A flow-through Hankel transform technique for rapid, accurate Green's function computation

Rapid and Accurate Computation of theDistance Function Using Grids

We present two fast and simple algorithms for approximating the distance function for given isolated points on uniform grids. The algorithms are then generalized to compute the distance to piecewise linear objects. By incorporating the geometry of Huygens’ principle in the reverse order with the classical viscosity solution theory for the eikonal equation |∇u| = 1, the algorithms become almost ...

The Hankel transform

A Novel Technique for Rapid-accurate 2D Hand Anthropometry

Rapid Computation of the Discrete Fourier Transform

Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...